Feature-aware Conditional GAN for Category Text Generation

نویسندگان

چکیده

Category text generation receives considerable attentions since it is beneficial for various natural language processing tasks. Recently, the generative adversarial network (GAN) has attained promising performance in generation, attributed to its training process. However, there are several issues GANs, including discreteness, instability, mode collapse, lack of diversity and controllability etc. To address these issues, this paper proposes a novel GAN framework, feature-aware conditional (FA-GAN), controllable category generation. In FA-GAN, generator sequence-to-sequence structure improving sentence diversity, which consists three encoders special encoder category-aware encoder, one relational-memory-core-based decoder with Gumbel SoftMax activation function. The discriminator an additional classification head. generate sentences specified categories, multi-class loss supplemented training. Comprehensive experiments have been conducted, results show that FA-GAN consistently outperforms 10 state-of-the-art approaches on 6 datasets. case study demonstrates synthetic generated by can match required categories aware features conditioned sentences, good readability, fluency, authenticity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adversarial Feature Matching for Text Generation

The Generative Adversarial Network (GAN) has achieved great success in generating realistic (realvalued) synthetic data. However, convergence issues and difficulties dealing with discrete data hinder the applicability of GAN to text. We propose a framework for generating realistic text via adversarial training. We employ a long shortterm memory network as generator, and a convolutional network ...

متن کامل

Feature Aware Multiresolution Animation Models Generation

In computer graphics, investigation has been made in many years in LOD (Level of Detail) models generation to alleviate the workload of visualization processing. However, most of the existing algorithms only focus on static models, and very little works are to deal with animation models. In this paper, we propose a feature aware method for generating multiresolution animation models. By the met...

متن کامل

Category Discrimination Based Feature Selection Algorithm in Chinese Text Classification

How to improve the classification precision is a major issue in the field of Chinese text classification. The tf-idf algorithm is a classic and widely-used feature selection algorithm based on VSM. But the traditional tf-idf algorithm neglects the feature term’s distribution inside category and among categories, which causes many unreasonable selective results. This paper makes an improvement t...

متن کامل

Feature Generation for Text Categorization Using World Knowledge

We enhance machine learning algorithms for text categorization with generated features based on domain-specific and common-sense knowledge. This knowledge is represented using publicly available ontologies that contain hundreds of thousands of concepts, such as the Open Directory; these ontologies are further enriched by several orders of magnitude through controlled Web crawling. Prior to text...

متن کامل

Unsupervised Feature Generation using Knowledge Repositories for Effective Text Categorization

We propose an unsupervised feature generation algorithm using the repositories of human knowledge for effective text categorization. Conventional bag of words (BOW) depends on the presence / absence of keywords to classify the documents. To understand the actual context behind these keywords, we use knowledge concepts / hyperlinks from external knowledge sources through content and structure mi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2023

ISSN: ['0925-2312', '1872-8286']

DOI: https://doi.org/10.1016/j.neucom.2023.126352